Solving Weighted Max-SAT Problems in a Reduced Search Space: A Performance Analysis

نویسندگان

  • Knot Pipatsrisawat
  • Akop Palyan
  • Mark Chavira
  • Arthur Choi
  • Adnan Darwiche
چکیده

We analyze, in this work, the performance of a recently introduced weighted Max-SAT solver, Clone, in the Max-SAT evaluation 2007. Clone utilizes a novel bound computation based on formula compilation that allows it to search in a reduced search space. We study how additional techniques from the SAT and Max-SAT literature affect the performance of Clone on problems from the evaluation. We then perform further investigations on factors that may affect the performance of leading Max-SAT solvers. We empirically identify two properties of weighted Max-SAT problems that can be used to adjust the difficulty level of the problems with respect to the considered solvers.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Clone: Solving Weighted Max-SAT in a Reduced Search Space

We introduce a new branch-and-bound Max-SAT solver, Clone, which employs a novel approach for computing lower bounds. This approach allows Clone to search in a reduced space. Moreover, Clone is equipped with novel techniques for learning from soft conflicts. Experimental results show that Clone performs competitively with the leading Max-SAT solver in the broadest category of this year’s Max-SA...

متن کامل

Discrete Lagrangian-Based Search for Solving MAX-SAT Problems

Weighted maximum satissability problems (MAX-SAT) are diicult to solve due to the large number of local minima in their search space. In this paper we propose a new discrete Lagrangian based search method (DLM) for solving these problems. Instead of restarting from a new point when the search reaches a local minimum, the Lagrange multipliers in DLM provide a force to lead the search out of the ...

متن کامل

A Logical Approach to Efficient Max-SAT solving

Weighted Max-SAT is the optimization version of SAT and many important problems can be naturally encoded as such. Solving weighted Max-SAT is an important problem from both a theoretical and a practical point of view. In recent years, there has been considerable interest in finding efficient solving techniques. Most of this work focus on the computation of good quality lower bounds to be used w...

متن کامل

ar X iv : c s . A I / 06 11 02 5 v 1 6 N ov 2 00 6 A Logical Approach to Efficient Max - SAT solving ⋆

Weighted Max-SAT is the optimization version of SAT and many important problems can be naturally encoded as such. Solving weighted Max-SAT is an important problem from both a theoretical and a practical point of view. In recent years, there has been considerable interest in finding efficient solving techniques. Most of this work focus on the computation of good quality lower bounds to be used w...

متن کامل

A Parallel GRASP for MAX-SAT Problems

The weighted maximum satis ability MAX SAT problem is central in mathematical logic computing theory and many indus trial applications In this paper we present a parallel greedy randomized adaptive search procedure GRASP for solving MAX SAT problems Experimental results indicate that almost linear speedup is achieved

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • JSAT

دوره 4  شماره 

صفحات  -

تاریخ انتشار 2008